Gödel Homomorphisms as Gödel Modal Operators
نویسنده
چکیده
We extend propositional Gödel logic by a unary modal operator, which we interpret as 5 Gödel homomorphisms, i.e. functions [0, 1] → [0, 1] that distribute over the interpretations of the 6 binary connectives of Gödel logic. We show that validity in the propositional fragment has a simple 7 superintuitionistic Hilbert-type proof system, which is not structurally complete, and that validity 8 does not change if we use the function class of continuous, strictly increasing functions. We also 9 give proof systems for restrictions to suband superdiagonal functions. 10
منابع مشابه
Project Report Logic Programming in Constructive Provability Logic 15-816 Modal Logic
We present a novel formulation of CPL, a constructive logic of provability that is closely connected to the Gödel-Löb logic of provability. Our logical formulation allows modal operators to talk about both provability and non-provability of propositions at reachable worlds. We use this logic as a basis for a discussion of negation in logic programming.
متن کاملA Finite Model Property for Gödel Modal Logics
A new semantics with the finite model property is provided and used to establish decidability for Gödel modal logics based on (crisp or fuzzy) Kripke frames combined locally with Gödel logic. A similar methodology is also used to establish decidability, and indeed co-NPcompleteness for a Gödel S5 logic that coincides with the one-variable fragment of first-order Gödel logic.
متن کاملBi-modal Gödel logic over [0,1]-valued Kripke frames
We consider the Gödel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard Gödel algebra [0,1] and prove strong completeness of Fischer Servi intuitionistic modal logic IK plus the prelinearity axiom with respect to this semantics. We axiomatize also the bi-modal analogues of T, S4, and S5 obtained by...
متن کاملMulti-adjoint Logic Programming with Continuous Semantics
Considering different implication operators, such as Lukasiewicz, Gödel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truthvalues. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved a...
متن کاملA modal perspective on defeasible reasoning
We introduce various new supraclassical entailment relations for defeasible reasoning and investigate some of their relationships. The contrapositive of the usual nonmonotonic preferential entailment turns out to be a monotonic supraclassical entailment. Analogously to these two, a nonmonotonic and its contrapositive monotonic supraclassical entailment can be defined by using modal operators re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 123 شماره
صفحات -
تاریخ انتشار 2013